Compact 4 × 4 butler matrix with non‐standard phase differences for IoT applications
نویسندگان
چکیده
منابع مشابه
Design and Implementation of a Planar 4 × 4 Butler Matrix in Siw Technology for Wide Band High Power Applications
This paper introduces a novel design of Butler matrix in substrate integrated waveguide (SIW) technology with wide frequency band characteristics. Butler matrices are particularly useful in advanced antenna design and characteristics such as wideband operation, power handling, manufacturing, integration, cost, etc. are typical issues to be addressed in many applications. The proposed planar 4 ×...
متن کاملA 4 × 4 Butler Matrix for 28 GHz Switched Multi-Beam Antenna
In this paper, a 4 × 4 Butler matrix (BM) switched-beam patch antenna array is designed and discussed. The design is developed on a single layer of Rogers material; RO 5880 with dielectric constant 2.2 and thickness 0.254mm.This makes the designed antenna low cost and easy of fabrication. The four rectangular patches fed by inset microstrip lines are connected to the outputs of the BM. The resu...
متن کاملA Design of Compact Ultra Wideband Coupler for Butler Matrix
A design of 3 dB compact ultra wideband (UWB) coupler for a 4 × 4 Butler Matrix, which is operating between 3 and 11 GHz frequency range, is presented in this paper. The proposed design uses multilayer technology that allows having a compact and broad bandwidth coupler. The design uses elliptically shaped broadside coupled strips and a slot created in a common ground plane of two dielectric sub...
متن کاملCompact Butler matrix using composite right/left handed transmission line
A novel composite right/left handed transmission line (CRLH TL) is proposed, for the first time using the Wunderlich-shaped dentiform capacitor and meandered-line short-circuited stub inductor (SSI). The CRLH TL features a larger value of CL and in turn a lower resonance relative to the previous one employing an interdigital capacitor and an SSI. The unique feature of the CRLH TL is applied to ...
متن کاملCounting 4×4 Matrix Partitions of Graphs
Given a symmetric matrix M ∈ {0, 1, ∗}D×D, anM -partition of a graph G is a function from V (G) to D such that no edge of G is mapped to a 0 of M and no non-edge to a 1. We give a computer-assisted proof that, when |D| = 4, the problem of counting the M -partitions of an input graph is either in FP or is #P-complete. Tractability is proved by reduction to the related problem of counting list M ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2021
ISSN: 0013-5194,1350-911X
DOI: 10.1049/ell2.12143